Radix tree

Results: 48



#Item
21Data Structures and Algorithm Analysis Edition 3.2 (C++ Version) Clifford A. Shaffer Department of Computer Science Virginia Tech

Data Structures and Algorithm Analysis Edition 3.2 (C++ Version) Clifford A. Shaffer Department of Computer Science Virginia Tech

Add to Reading List

Source URL: people.cs.vt.edu

Language: English - Date: 2012-01-02 10:08:45
22E DI CT The internal extent formula for compacted tries Paolo Boldi Sebastiano Vigna Universit`a degli Studi di Milano, Italy Abstract

E DI CT The internal extent formula for compacted tries Paolo Boldi Sebastiano Vigna Universit`a degli Studi di Milano, Italy Abstract

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2010-12-17 06:27:17
23On the Average Density and Selectivity of Nodes in Multi-Digit Tries Yuriy A. Reznik ∗ RealNetworks, IncElliott Avenue, Suite 1000 Seattle, WA 98121

On the Average Density and Selectivity of Nodes in Multi-Digit Tries Yuriy A. Reznik ∗ RealNetworks, IncElliott Avenue, Suite 1000 Seattle, WA 98121

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:19:09
24The JS Storage Engine Alon Itai* and Moshe Shadmon** *CS Department Technion Haifa, Israel

The JS Storage Engine Alon Itai* and Moshe Shadmon** *CS Department Technion Haifa, Israel

Add to Reading List

Source URL: scaledb.com

Language: English - Date: 2014-06-24 22:17:50
25Linear Work Suffix Array Construction Juha K¨arkk¨ainen∗ Peter Sanders†  Stefan Burkhardt‡

Linear Work Suffix Array Construction Juha K¨arkk¨ainen∗ Peter Sanders† Stefan Burkhardt‡

Add to Reading List

Source URL: algo2.iti.kit.edu

Language: English - Date: 2008-03-05 03:01:44
26IP Route Lookups as String Matching Austin Donnelly and Tim Deegan University of Cambridge Computer Laboratory Cambridge, CB2 3QG, U.K. E-mail: fAustin.Donnelly,

IP Route Lookups as String Matching Austin Donnelly and Tim Deegan University of Cambridge Computer Laboratory Cambridge, CB2 3QG, U.K. E-mail: fAustin.Donnelly,

Add to Reading List

Source URL: www.tjd.phlegethon.org

Language: English - Date: 2013-09-18 17:21:32
27Suffix arrays: A new method for on-line string searches Udi Manber1 Gene Myers2 Department of Computer Science

Suffix arrays: A new method for on-line string searches Udi Manber1 Gene Myers2 Department of Computer Science

Add to Reading List

Source URL: webglimpse.net

Language: English - Date: 2002-10-23 23:03:02
28HAT-trie: A Cache-conscious Trie-based Data Structure for Strings Nikolas Askitis Ranjan Sinha  School of Computer Science and Information Technology,

HAT-trie: A Cache-conscious Trie-based Data Structure for Strings Nikolas Askitis Ranjan Sinha School of Computer Science and Information Technology,

Add to Reading List

Source URL: crpit.com

Language: English - Date: 2012-01-19 01:28:15
29Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications Yin Zhang? Sumeet Singh§ Subhabrata Sen? Nick Duffield? Carsten Lund? AT&T Labs – Research, Florham Park, NJ 07932, USA?

Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications Yin Zhang? Sumeet Singh§ Subhabrata Sen? Nick Duffield? Carsten Lund? AT&T Labs – Research, Florham Park, NJ 07932, USA?

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2004-10-23 00:21:56
30RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

Add to Reading List

Source URL: people.csail.mit.edu

Language: English